package WEEK_192;

import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;

import LCommon.TreeMethod;
import LCommon.TreeNode;

public class Test {

	public static void main(String[] args) {

//		int[] nums = { 2, 5, 1, 3, 4, 7 };
//		int n = 3;
//		System.out.println(Arrays.toString(new Solution().shuffle(nums, n)));
		
		
		int[] arr  = { 1,1,3,5,5 };
		int k = 2;
		
		System.out.println(Arrays.toString(new Solution().getStrongest(arr, k)));
	
	}

}
